本文介绍了一个数据集，用于培训和评估方法，以估算由标准RGB摄像机捕获的任务演示中手持工具的6D姿势。尽管6D姿势估计方法取得了重大进展，但它们的性能通常受到严重遮挡的对象的限制，这在模仿学习中是一个常见的情况，而操纵手通常会部分遮住对象。当前，缺乏数据集可以使这些条件的稳健6D姿势估计方法开发。为了克服这个问题，我们收集了一个新的数据集（IMITROB），该数据集针对模仿学习和其他人类持有工具并执行任务的其他应用中的6D姿势估计。该数据集包含三个不同工具和六个操纵任务的图像序列，这些任务具有两个相机观点，四个人类受试者和左/右手。每个图像都伴随着由HTC Vive运动跟踪设备获得的6D对象姿势的准确地面真相测量。通过训练和评估各种设置中的最新6D对象估计方法（DOPE）来证明数据集的使用。数据集和代码可在http://imitrob.ciirc.cvut.cz/imitrobdataset.php上公开获得。

Motivated by the fragility of neural network (NN) controllers in safety-critical applications, we present a data-driven framework for verifying the risk of stochastic dynamical systems with NN controllers. Given a stochastic control system, an NN controller, and a specification equipped with a notion of trace robustness (e.g., constraint functions or signal temporal logic), we collect trajectories from the system that may or may not satisfy the specification. In particular, each of the trajectories produces a robustness value that indicates how well (severely) the specification is satisfied (violated). We then compute risk metrics over these robustness values to estimate the risk that the NN controller will not satisfy the specification. We are further interested in quantifying the difference in risk between two systems, and we show how the risk estimated from a nominal system can provide an upper bound the risk of a perturbed version of the system. In particular, the tightness of this bound depends on the closeness of the systems in terms of the closeness of their system trajectories. For Lipschitz continuous and incrementally input-to-state stable systems, we show how to exactly quantify system closeness with varying degrees of conservatism, while we estimate system closeness for more general systems from data in our experiments. We demonstrate our risk verification approach on two case studies, an underwater vehicle and an F1/10 autonomous car.

我们研究了基于数据的多模型线性推理（软）传感器的问题。多模型线性推论传感器有望提高预测准确性，但模型结构和训练的简单性。多模型推断传感器设计的标准方法由三个单独的步骤组成：1）数据标记（建立单个模型的培训子集），2）数据分类（为模型创建切换逻辑），3）楷模。这个概念有两个主要问题：a）作为步骤2）和3）是单独的，在模型之间切换时可能会发生不连续性； b）作为步骤1）和3）是独立的，数据标记无视所得模型的质量。我们的贡献旨在提到这两个问题，在其中，对于问题a），我们引入了一种新型的基于SVM的模型训练，再加上切换逻辑识别，并且对于问题b），我们建议对数据标记进行直接优化。我们在化学工程领域的一个例子中说明了提出的方法及其好处。

Most graph neural network models rely on a particular message passing paradigm, where the idea is to iteratively propagate node representations of a graph to each node in the direct neighborhood. While very prominent, this paradigm leads to information propagation bottlenecks, as information is repeatedly compressed at intermediary node representations, which causes loss of information, making it practically impossible to gather meaningful signals from distant nodes. To address this issue, we propose shortest path message passing neural networks, where the node representations of a graph are propagated to each node in the shortest path neighborhoods. In this setting, nodes can directly communicate between each other even if they are not neighbors, breaking the information bottleneck and hence leading to more adequately learned representations. Theoretically, our framework generalizes message passing neural networks, resulting in provably more expressive models, and we show that some recent state-of-the-art models are special instances of this framework. Empirically, we verify the capacity of a basic model of this framework on dedicated synthetic experiments, and on real-world graph classification and regression benchmarks, and obtain state-of-the-art results.

由于机器学习技术在新域中被广泛采用，特别是在诸如自主车辆的安全关键系统中，这是提供准确的输出不确定性估计至关重要。因此，已经提出了许多方法来校准神经网络以准确估计错误分类的可能性。但是，虽然这些方法实现了低校准误差，但有空间以进一步改进，尤其是在大维设置（如想象成）中。在本文中，我们介绍了一个名为Hoki的校准算法，它通过将随机转换应用于神经网络编程来工作。我们为基于应用转换后观察到的标签预测变化的数量提供了足够的条件。我们在多个数据集上执行实验，并表明所提出的方法通常优于多个数据集和模型的最先进的校准算法，尤其是在充满挑战的ImageNet数据集上。最后，Hoki也是可扩展的，因为它需要可比较的执行时间到温度缩放的执行时间。